Neural Networks with Quadratic VC Dimension
نویسندگان
چکیده
منابع مشابه
Neural Networks with Quadratic VC Dimension
This paper shows that neural networkswhich use continuousactivation functions have VC dimension at least as large as the square of the number of weights w. This results settles a long-standing open question, namely whether the well-known O(w log w) bound, known for hardthreshold nets, also held for more general sigmoidal nets. Implications for the number of samples needed for valid generalizati...
متن کاملVC Dimension of Neural Networks
This paper presents a brief introduction to Vapnik-Chervonenkis (VC) dimension, a quantity which characterizes the difficulty of distribution-independent learning. The paper establishes various elementary results, and discusses how to estimate the VC dimension in several examples of interest in neural network theory.
متن کاملOn the VC-dimension of neural networks with binary weights
We investigate the VC-dimension of the perceptron and simple two-layer networks like the committeeand the parity-machine with weights restricted to values ±1. For binary inputs, the VC-dimension is determined by atypical pattern sets, i.e. it cannot be found by replica analysis or numerical Monte Carlo sampling. For small systems, exhaustive enumerations yield exact results. For systems that ar...
متن کاملNeural Networks with Local Receptive Fields and Superlinear VC Dimension
Local receptive field neurons comprise such well-known and widely used unit types as radial basis function (RBF) neurons and neurons with center-surround receptive field. We study the Vapnik-Chervonenkis (VC) dimension of feedforward neural networks with one hidden layer of these units. For several variants of local receptive field neurons, we show that the VC dimension of these networks is sup...
متن کاملNeural Nets with Superlinear VC-Dimension
It has been known for quite a while that the Vapnik-Chervonenkis dimension (VC-dimension) of a feedforward neural net with linear threshold gates is at most O(w . log w), where w is the total number of weights in the neural net. We show in this paper that this bound is in fact asymptotically optimal. More precisely, we exhibit for any depth d 2 3 a large class of feedforward neural nets of dept...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1479